منابع مشابه
Ising formulations of many NP problems
*Correspondence: Andrew Lucas, Lyman Laboratory of Physics, Department of Physics, Harvard University, 17 Oxford St., Cambridge, MA 02138, USA e-mail: [email protected] We provide Ising formulations for many NP-complete and NP-hard problems, including all of Karp’s 21 NP-complete problems. This collects and extends mappings to the Ising model from partitioning, covering, and satisfiability....
متن کاملThe Ising Model Is NP - Complete
In 1925, the German physicist Ernst Ising introduced a simple mathematical model of phase transitions, the abrupt changes of state that occur, for example, when water freezes or a cooling lump of iron becomes magnetic. In the 75 years since, the Ising model has been analyzed, generalized, and computerized—but never, except in special cases, solved. Researchers managed to get exact answers for p...
متن کاملThe Many-Worlds and Many-Minds Formulations of Quantum Mechanics
The many-worlds and many-minds formulations of quantum mechanics are reconstructions of Hugh Everett ill's (19578, 1957b, 1973) relative-state fonnulation of quantum mechanics. Each is presented as a proposal for solving the quantum measurement problem. Much of the philosophical interest in these theories derives from the metaphysical commitments they suggest. They illustrate the roles played b...
متن کاملMany Many Problems
Recently four different papers have suggested that the supervaluational solution to the Problem of the Many is flawed. Stephen Schiffer (1998, 2000a,b) has argued that the theory cannot account for reports of speech involving vague singular terms. Vann McGee and Brian McLaughlin (2000) say that theory cannot, yet, account for vague singular beliefs. Neil McKinnon (2002) has argued that we canno...
متن کاملLecture 29: Np-hard Problems [fa'12] 29 Np-hard Problems 29.1 'efficient' Problems
A generally-accepted minimum requirement for an algorithm to be considered ‘efficient’ is that its running time is polynomial: O(nc) for some constant c, where n is the size of the input.1 Researchers recognized early on that not all problems can be solved this quickly, but we had a hard time figuring out exactly which ones could and which ones couldn’t. there are several so-called NP-hard prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Physics
سال: 2014
ISSN: 2296-424X
DOI: 10.3389/fphy.2014.00005